Quasi-random graphs and graph limits
نویسندگان
چکیده
منابع مشابه
Quasi-random graphs and graph limits
We use the theory of graph limits to study several quasirandom properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons, and to show that the resulting graphon properties only can be satisfied by constant graphons. These quasi-random properties have been studied before by other ...
متن کاملMore on quasi-random graphs, subgraph counts and graph limits
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investig...
متن کاملGraph Limits and Exchangeable Random Graphs
We develop a clear connection between deFinetti’s theorem for exchangeable arrays (work of Aldous–Hoover–Kallenberg) and the emerging area of graph limits (work of Lovász and many coauthors). Along the way, we translate the graph theory into more classical prob-
متن کاملThreshold Graph Limits and Random Threshold Graphs
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
متن کاملQuasi-Random Oriented Graphs
We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham and Wilson [5] in the case of unoriented graphs, and by Chung and Graham [3] in the case of tournaments. Indeed, our main theorem extends to the case of a general underlying graph G th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.03.011